Efficient algorithms for packing boxes into container
نویسندگان
چکیده
منابع مشابه
Greedy algorithms for packing unequal circles into a rectangular container
In this paper, we study the problem of packing unequal circles into a 2D rectangular container. We solve this problem by proposing two greedy algorithms. The first algorithm, denoted by B1.0, selects the next circle to place according to the maximum hole degree rule, which is inspired from human activity in packing. The second algorithm, denoted by B1.5, improves B1.0 with a self look-ahead sea...
متن کاملPacking ellipsoids into volume-minimizing rectangular boxes
A set of tri-axial ellipsoids, with given semi-axes, is to be packed into a rectangular box; its widths, lengths and height are subject to lower and upper bounds. We want to minimize the volume of this box and seek an overlap-free placement of the ellipsoids which can take any orientation. We present closed non-convex NLP formulations for this ellipsoid packing problem based on purely algebraic...
متن کاملGenetic Algorithms for the Multiple Container Packing Problem
This paper presents two variants of Genetic Algorithms (GAs) for solving the Multiple Container Packing Problem (MCPP), which is a combinatorial optimization problem comprising similarities to the Knapsack Problem and the Bin Packing Problem. Two different representation schemes are suggested, namely direct encoding and order based encoding. While order based encoded solutions are always feasib...
متن کاملNew heuristics for packing unequal circles into a circular container
We propose two new heuristics to pack unequal circles into a two dimensional circular container. The first one, denoted by A1.0, is a basic heurisitc which selects the next circle to place according to the maximal hole degree rule. The second one, denoted by A1.5, uses a self lookahead strategy to improve A1.0. We evaluate A1.0 and A1.5 on a series of instances up to 100 circles from the litera...
متن کاملEfficient Sequential Decision-Making Algorithms for Container Inspection Operations
Following work of Stroud and Saeger (Proceedings of ISI, Springer Verlag, New York, 2006) and Anand et al. (Proceedings of Computer, Communication and Control Technologies, 2003), we formulate a port of entry inspection sequencing task as a problem of finding an optimal binary decision tree for an appropriate Boolean decision function. We report on new algorithms for finding such optimal trees ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Anais da Academia Brasileira de Ciências
سال: 2002
ISSN: 1678-2690,0001-3765
DOI: 10.1590/s0001-37652002000300035